Geometrical Algorithms for Packet Filter Conflict Detection (Offline)
نویسنده
چکیده
We develop geometrical algorithms for conflict detection in Internet packet filter sets with arbitrary ranges and based on the best-rule-matches principle. Data structures originally devised for solving Klee’s measure problem are examined for their usability in this context. We then show how to solve the one-dimensional problem in O (n log n) time, how to solve the two-dimensional problem in O (n √n log n + k) time, and generalize this approach for d dimensions and O (n (d +) ⁄ log n + k) time. Implementations and benchmark results are presented for the one-dimensional and twodimensional cases.
منابع مشابه
OPTIMAL SENSOR PLACEMENT FOR DAMAGE DETECTION BASED ON A NEW GEOMETRICAL VIEWPOINT
In this study, efficient methods for optimal sensor placement (OSP) based on a new geometrical viewpoint for damage detection in structures is presented. The purpose is to minimize the effects of noise on the damage detection process. In the geometrical viewpoint, a sensor location is equivalent to projecting the elliptical noise on to a face of response space which is corresponding to the sens...
متن کاملAn Efficient Conflict Detection Algorithm for Packet Filters
Packet classification is essential for supporting advanced network services such as firewalls, quality-of-service (QoS), virtual private networks (VPN), and policy-based routing. The rules that routers use to classify packets are called packet filters. If two or more filters overlap, a conflict occurs and leads to ambiguity in packet classification. This study proposes an algorithm that can eff...
متن کاملTitle: Ip Lookup under a Persistent Data Structure (offline)
In many applications, the rule to be applied is chosen based on a single field of the packet header: the destination address. When an incoming packet matches more than one filter and there is no criterion that breaks the tie (either to pick the filter with the highest priority, or to pick the most-specific filter, etc.), the router cannot unambiguously categorise the packet. Thus, one considers...
متن کاملDetecting and Resolving Packet Filter Conflicts
Adiseshu Hari 1, Subhash Suri2, Guru Parulkar2 1Bell Laboratories 2Washington University 101 Crawfords Corner Road Box 1045 Holmdel, NJ 07733, USA St. Louis, MO 63130, USA [email protected] (suri, guri)@cs.wustl.edu Abstract—1 Packet filters are rules for classifying packets based on their header fields. Packet classification is essential to routers supporting services such as Quality of Servi...
متن کاملOffline Language-free Writer Identification based on Speeded-up Robust Features
This article proposes offline language-free writer identification based on speeded-up robust features (SURF), goes through training, enrollment, and identification stages. In all stages, an isotropic Box filter is first used to segment the handwritten text image into word regions (WRs). Then, the SURF descriptors (SUDs) of word region and the corresponding scales and orientations (SOs) are extr...
متن کامل